Cut Size Statistics of Graph Bisection Heuristics
نویسندگان
چکیده
منابع مشابه
Cut Size Statistics of Graph Bisection Heuristics
We investigate the statistical properties of cut sizes generated by heuristic algorithms which solve the graph bisection problem approximately. On an ensemble of sparse random graphs, we find empirically that the distribution of the cut sizes found by “local” algorithms becomes peaked as the number of vertices in the graphs becomes large. Evidence is given that this distribution tends toward a ...
متن کاملBetween Min Cut and Graph Bisection between Min Cut and Graph Bisection
We investigate a class of graph partitioning problems whose two extreme representatives are the well-known Min Cut and Graph Bisection problems. The former is known to be eeciently solvable by ow techniques, the latter to be NP-complete. The results presented in this paper are { a monotony result of the type \The more balanced the partition we look for has to be, the harder the problem". { a co...
متن کاملSeed-growth Heuristics for Graph Bisection
We investigate a family of algorithms for graph bisection that are based on a simple local connectivity heuristic, which we call seedgrowth. We show how the heuristic can be combined with stochastic search procedures and a postprocess application of the KernighanLin algorithm. In a series of time-equated comparisons against largesample runs of pure Kernighan-Lin, the new algorithms nd bisection...
متن کاملOn the Graph Bisection Cut Polytope
Given a graph G = (V,E) with node weights φv ∈ N ∪ {0}, v ∈ V , and some number F ∈ N∪{0}, the convex hull of the incidence vectors of all cuts δ(S), S ⊆ V with φ(S) ≤ F and φ(V \ S) ≤ F is called the bisection cut polytope. We study the facial structure of this polytope which shows up in many graph partitioning problems with applications in VLSI-design or frequency assignment. We give necessar...
متن کاملGraph bisection algorithms
In this thesis, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d > 3, all sufficiently large n and all b = o(ni-1/d2lJ), the algorithm finds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1999
ISSN: 1052-6234,1095-7189
DOI: 10.1137/s1052623497321523